An adaptive stochastic sequential quadratic programming with differentiable exact augmented lagrangians
نویسندگان
چکیده
We consider solving nonlinear optimization problems with a stochastic objective and deterministic equality constraints. assume for the that its evaluation, gradient, Hessian are inaccessible, while one can compute their estimates by, example, subsampling. propose algorithm based on sequential quadratic programming (SQP) uses differentiable exact augmented Lagrangian as merit function. To motivate our design, we first revisit simplify an old SQP method Lucidi (J. Optim. Theory Appl. 67(2): 227–245, 1990) developed problems, which serves skeleton of algorithm. Based simplified algorithm, then non-adaptive dealing objective, where gradient replaced by but stepsizes prespecified. Finally, incorporate recent line search procedure Paquette Scheinberg (SIAM J. 30(1): 349–376 2020) into to adaptively select random stepsizes, leads adaptive SQP. The global “almost sure” convergence both methods is established. Numerical experiments in CUTEst test set demonstrate superiority
منابع مشابه
Exact Nonnull Wavelike Solutions to Gravity with Quadratic Lagrangians
Solutions to gravity with quadratic Lagrangians are found for the simple case where the only nonconstant metric component is the lapse N and the Riemann tensor takes the form R .itj = −kikj , i, j = 1, 2, 3; thus these solutions depend on cross terms in the Riemann tensor and therefore complement the linearized theory where it is the derivatives of the Riemann tensor that matter. The relationsh...
متن کاملAugmented Lagrangians in semi-infinite programming
We consider the class of semi-infinite programming problems which became in recent years a powerful tool for the mathematical modelling of many real-life problems. In this paper, we study an augmented Lagrangian approach to semi-infinite problems and present necessary and sufficient conditions for the existence of corresponding augmented Lagrange multipliers. Furthermore, we discuss two particu...
متن کاملStabilized Sequential Quadratic Programming
Recently, Wright proposed a stabilized sequential quadratic programming algorithm for inequality constrained optimization. Assuming the Mangasarian-Fromovitz constraint qualification and the existence of a strictly positive multiplier (but possibly dependent constraint gradients), he proved a local quadratic convergence result. In this paper, we establish quadratic convergence in cases where bo...
متن کاملSequential Quadratic Programming �
Introduction Since its popularization in the late s Sequential Quadratic Program ming SQP has arguably become the most successful method for solving nonlinearly constrained optimization problems As with most optimization methods SQP is not a single algorithm but rather a conceptual method from which numerous speci c algorithms have evolved Backed by a solid theoretical and computational foundat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2022
ISSN: ['0025-5610', '1436-4646']
DOI: https://doi.org/10.1007/s10107-022-01846-z